An Optimal Voting System When Voting is Costly - A Case Study in Dynamic Mechanism Design
نویسندگان
چکیده
We propose a formulation for the problem of designing an optimal dynamic voting system when voting is costly. The possibility to coordinate participation by voting sequentially requires explicit maximization over a set of dynamic mechanisms which involves some arguments that are new to the theory of mechanism design. For a highly stylized specification of our model with private values and two alternatives we show the optimality of a voting system that combines two main elements: (i) there is an arbitrarily chosen default decision and non-participation is interpreted as a vote in favor of the default; (ii) voting is sequential and is terminated when a supermajority requirement, which declines over time, is met. We show the optimality of such a voting system by arguing that it is first best, that is, it maximizes welfare when incentive compatibility constraints are ignored, and by showing that individual incentives and social welfare can be sufficiently aligned to make a first best system incentive compatible. This paper supersedes a previous draft entitled "Dynamic Mechanism Design with Costly Participation." We are grateful to Arthur Lupia, Romans Pancs, Alessandro Pavan, Marek Pycia, Ilya Segal, Ricky Vohra, and two anonymous referees for helpful comments and to Yan-Min Choo for research assistance. Tilman Börgers thanks the Center for Mathematical Studies in Economics and Management Science at Northwestern University for the hospitality that it offered while he was working on this paper. Moritz Meyer-ter-Vehn thanks the Hausdorff Research Institute for Mathematics in Bonn for its hospitality, which he enjoyed while working on this paper. [email protected]. Department of Economics, University of Michigan, [email protected]. Department of Economics, UCLA, [email protected].
منابع مشابه
An Optimal Voting Procedure When Voting is Costly - A Case Study in Dynamic Mechanism Design
We propose a formulation for the problem of designing an optimal dynamic voting procedure when voting is costly. The possibility to coordinate participation by voting sequentially requires explicit maximization over a set of dynamic mechanisms which involves some arguments that are new to the theory of mechanism design. For a highly stylized specification of our model with private values, two a...
متن کاملOptimal Voting Rules When Voting is Costly - Sequentiality, Default Choices and Committees
We study costly voting as a dynamic mechanism design problem and identify three characteristics of any optimal mechanism in a highly stylized setting: (1) sequential participation decisions, (2) interpreting non-participation as a vote for some default, and (3) delegating the vote to a committee that excludes some voters.
متن کاملAn Optimal Voting System When Voting is Costly∗
We consider the design of an optimal voting system when voting is costly. For a private values model with two alternatives we show the optimality of a voting system that combines three elements: (i) there is an arbitrarily chosen default decision and non-participation is interpreted as a vote in favor of the default; (ii) voting is sequential; (iii) not all voters are invited to participate in ...
متن کاملVoting Algorithm Based on Adaptive Neuro Fuzzy Inference System for Fault Tolerant Systems
some applications are critical and must designed Fault Tolerant System. Usually Voting Algorithm is one of the principle elements of a Fault Tolerant System. Two kinds of voting algorithm are used in most applications, they are majority voting algorithm and weighted average algorithm these algorithms have some problems. Majority confronts with the problem of threshold limits and voter of weight...
متن کاملVoting Algorithm Based on Adaptive Neuro Fuzzy Inference System for Fault Tolerant Systems
some applications are critical and must designed Fault Tolerant System. Usually Voting Algorithm is one of the principle elements of a Fault Tolerant System. Two kinds of voting algorithm are used in most applications, they are majority voting algorithm and weighted average algorithm these algorithms have some problems. Majority confronts with the problem of threshold limits and voter of weight...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012